Practical regular expression matching free of scalability and performance barriers
نویسندگان
چکیده
http://dx.doi.org/10.1016/j.comcom.2014.08.005 0140-3664/ 2014 Elsevier B.V. All rights reserved. ⇑ Corresponding author at: Department of Automation, Tsinghua University, Beijing, China. E-mail addresses: [email protected] (K. Wang), fu-z13@mails. tsinghua.edu.cn (Z. Fu), [email protected] (X. Hu), [email protected]. cn (J. Li). Kai Wang a,b,⇑, Zhe Fu , Xiaohe Hu , Jun Li b,c
منابع مشابه
DotStar: Breaking the Scalability and Performance Barriers in Regular Expression Set Matching
Regular expressions are widely used to parse data and to detect recurrent patterns and information: they are a common choice for defining configurable rules for a variety of systems. In fact, many dataintensive applications rely on regular expression parsing as the first line of defense to perform on-line data filtering. Unfortunately, few solutions can keep up with the increasing data rates an...
متن کاملA Fast Regular Expression Indexing Engine
In this paper, we describe the design, architecture, and the lessons learned from the implementation of a fast regular expression indexing engine FREE. FREE uses a prebuilt index to identify the text data units which may contain a matching string and only examines these further. In this way, FREE shows orders of magnitude performance improvement in certain cases over standard regular expression...
متن کاملPrefix-Free Regular-Expression Matching
We explore the regular-expression matching problem with respect to prefix-freeness of the pattern. We show that the prefix-free regular expression gives only linear number of matching substrings in the size of a given text. Based on this observation, we propose an efficient algorithm for the prefix-free regular-expression matching problem. Furthermore, we suggest an algorithm to determine wheth...
متن کاملMatching Integral Graphs of Small Order
In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...
متن کاملPrefix-free regular languages and pattern matching
We explore the regular-expression matching problem with respect to prefix-freeness of the pattern. We prove that a prefix-free regular expression gives only a linear number of matching substrings in the size of a given text. Based on this observation, we propose an efficient algorithm for the prefix-free regular-expression matching problem. Furthermore, we suggest an algorithm to determine whet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Communications
دوره 54 شماره
صفحات -
تاریخ انتشار 2014